Transforming Sequences using Threaded Morphisms
نویسنده
چکیده
Sequences are very useful structures in programming languages. Functional programming languages allow the convenient deenition of transformations between sequence algebras and other types of data algebra. Sequence homomorphisms are an important class of such transformations. However, not all desired transformations can be expressed as homomor-phisms. This paper describes a class of transformation which is a gen-eralisation of homomorphisms: sequence morphisms with threads. This class is shown to contain a number of interesting sub-classes of transformation. The morphisms are described using a simple functional programming language and are applied to the design and implementation of a simple object-oriented programming language feature.
منابع مشابه
Toroidalization of locally toroidal morphisms of 3-folds
A toroidalization of a dominant morphism $varphi: Xto Y$ of algebraic varieties over a field of characteristic zero is a toroidal lifting of $varphi$ obtained by performing sequences of blow ups of nonsingular subvarieties above $X$ and $Y$. We give a proof of toroidalization of locally toroidal morphisms of 3-folds.
متن کاملMorphisms, Symbolic sequences, and their Standard Forms
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member out of all these morphisms. This has applications to the classification of the shift dynamical systems generated by morphisms. In a similar way, we propose th...
متن کاملRecognizability for Sequences of Morphisms
We investigate different notions of recognizability for a free monoid morphism σ : A∗ → B∗. Full recognizability occurs when each (aperiodic) point in BZ admits at most one tiling with words σ(a), a ∈ A. This is stronger than the classical notion of recognizability of a substitution σ : A∗ → A∗, where the tiling must be compatible with the language of the substitution. We show that if |A| = 2, ...
متن کاملRational Tree Morphisms and Transducer Integer Sequences: Definition and Examples
The notion of transducer integer sequences is considered through a series of examples (the chosen examples are related to the Tower of Hanoi problem on 3 pegs). By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite transducers encoding rational tree morphisms (length and prefix preserving transformations of words that have only fi...
متن کاملEffective Inline-Threaded Interpretation of Java Bytecode Using Preparation Sequences
Inline-threaded interpretation is a recent technique that improves performance by eliminating dispatch overhead within basic blocks for interpreters written in C [11]. The dynamic class loading, lazy class initialization, and multi-threading features of Java reduce the effectiveness of a straight-forward implementation of this technique within Java interpreters. In this paper, we introduce prep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007